A Constraint-Based Framework for Computing Privacy Preserving OLAP Aggregations on Data Cubes
نویسندگان
چکیده
A constraint-based framework for computing privacy preserving OLAP aggregations on data cubes is proposed and experimentally assessed in this paper. Our framework introduces a novel privacy OLAP notion, which, following consolidated paradigms of OLAP research, looks at the privacy of aggregate patterns defined on multidimensional ranges rather than the privacy of individual tuples/data-cells, like similar efforts in privacy preserving database and data-cube research. To this end, we devise a threshold-based method that aims at simultaneously accomplishing the so-called privacy constraint, which inferiorly bounds the inference error, and the so-called accuracy constraint, which superiorly bounds the query error, on OLAP aggregations of the target data cube, following a best-effort approach. Finally, we complete our main theoretical contribution by means of an experimental evaluation and analysis of the effectiveness of our proposed framework on synthetic, benchmark and real-life data cubes.
منابع مشابه
Theory-Inspired Optimizations for Privacy Preserving Distributed OLAP Algorithms
Actually, a lot of attention focusing on the problem of computing privacy-preserving OLAP cubes effectively and efficiently arises. State-of-theart proposals rather focus on an algorithmic vision of the problem, and neglect relevant theoretical aspects the investigated problem introduces naturally. In order to fulfill this gap, in this paper we provide algorithms for supporting privacy-preservi...
متن کاملA cubic-wise balance approach for privacy preservation in data cubes
A data warehouse stores current and historical records consolidated from multiple transactional systems. Securing data warehouses is of ever increasing interest, especially considering areas where data are sold in pieces to third parties for data mining practices. In this case, existing data warehouse security techniques, such as data access control, may not be easy to enforce and can be ineffe...
متن کاملA centralized privacy-preserving framework for online social networks
There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...
متن کاملComputing Data Cubes and Aggregate Query Processing
The paper is dealing with data cubes, multidimensional data structures built from data warehouse for OLAP purposes. Performing aggregations over cube dimensions and the way they are stored is considered to be a problem worth optimization. A two-tier multilevel list structure for storing cubes has been proposed. Algorithms for tiers’ setup and maintenance when records are loaded into the data wa...
متن کاملA Comprehensive Theoretical Framework for Privacy Preserving Distributed OLAP
This paper complements the privacy preserving distributed OLAP framework proposed by us in a previous work by introducing four major theoretical properties that extend models and algorithms presented in the previous work, where the experimental validation of the framework has also been reported. Particularly, our framework makes use of the CUR matrix decomposition technique as the elementary co...
متن کامل